Termination w.r.t. Q proof of TRS/TRCSREx2_Luc03b

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

fst(0, Z) → nil
fst(s(X), cons(Y, Z)) → cons(Y, n__fst(activate(X), activate(Z)))
from(X) → cons(X, n__from(s(X)))
add(0, X) → X
add(s(X), Y) → s(n__add(activate(X), Y))
len(nil) → 0
len(cons(X, Z)) → s(n__len(activate(Z)))
fst(X1, X2) → n__fst(X1, X2)
from(X) → n__from(X)
add(X1, X2) → n__add(X1, X2)
len(X) → n__len(X)
activate(n__fst(X1, X2)) → fst(X1, X2)
activate(n__from(X)) → from(X)
activate(n__add(X1, X2)) → add(X1, X2)
activate(n__len(X)) → len(X)
activate(X) → X

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

fst(0, Z) → nil
fst(s(X), cons(Y, Z)) → cons(Y, n__fst(activate(X), activate(Z)))
from(X) → cons(X, n__from(s(X)))
add(0, X) → X
add(s(X), Y) → s(n__add(activate(X), Y))
len(nil) → 0
len(cons(X, Z)) → s(n__len(activate(Z)))
fst(X1, X2) → n__fst(X1, X2)
from(X) → n__from(X)
add(X1, X2) → n__add(X1, X2)
len(X) → n__len(X)
activate(n__fst(X1, X2)) → fst(X1, X2)
activate(n__from(X)) → from(X)
activate(n__add(X1, X2)) → add(X1, X2)
activate(n__len(X)) → len(X)
activate(X) → X

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

ACTIVATE(n__fst(X1, X2)) → FST(X1, X2)
FST(s(X), cons(Y, Z)) → ACTIVATE(X)
ACTIVATE(n__len(X)) → LEN(X)
ADD(s(X), Y) → ACTIVATE(X)
ACTIVATE(n__add(X1, X2)) → ADD(X1, X2)
ACTIVATE(n__from(X)) → FROM(X)
LEN(cons(X, Z)) → ACTIVATE(Z)
FST(s(X), cons(Y, Z)) → ACTIVATE(Z)

The TRS R consists of the following rules:

fst(0, Z) → nil
fst(s(X), cons(Y, Z)) → cons(Y, n__fst(activate(X), activate(Z)))
from(X) → cons(X, n__from(s(X)))
add(0, X) → X
add(s(X), Y) → s(n__add(activate(X), Y))
len(nil) → 0
len(cons(X, Z)) → s(n__len(activate(Z)))
fst(X1, X2) → n__fst(X1, X2)
from(X) → n__from(X)
add(X1, X2) → n__add(X1, X2)
len(X) → n__len(X)
activate(n__fst(X1, X2)) → fst(X1, X2)
activate(n__from(X)) → from(X)
activate(n__add(X1, X2)) → add(X1, X2)
activate(n__len(X)) → len(X)
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

Q DP problem:
The TRS P consists of the following rules:

ACTIVATE(n__fst(X1, X2)) → FST(X1, X2)
FST(s(X), cons(Y, Z)) → ACTIVATE(X)
ACTIVATE(n__len(X)) → LEN(X)
ADD(s(X), Y) → ACTIVATE(X)
ACTIVATE(n__add(X1, X2)) → ADD(X1, X2)
ACTIVATE(n__from(X)) → FROM(X)
LEN(cons(X, Z)) → ACTIVATE(Z)
FST(s(X), cons(Y, Z)) → ACTIVATE(Z)

The TRS R consists of the following rules:

fst(0, Z) → nil
fst(s(X), cons(Y, Z)) → cons(Y, n__fst(activate(X), activate(Z)))
from(X) → cons(X, n__from(s(X)))
add(0, X) → X
add(s(X), Y) → s(n__add(activate(X), Y))
len(nil) → 0
len(cons(X, Z)) → s(n__len(activate(Z)))
fst(X1, X2) → n__fst(X1, X2)
from(X) → n__from(X)
add(X1, X2) → n__add(X1, X2)
len(X) → n__len(X)
activate(n__fst(X1, X2)) → fst(X1, X2)
activate(n__from(X)) → from(X)
activate(n__add(X1, X2)) → add(X1, X2)
activate(n__len(X)) → len(X)
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

FST(s(X), cons(Y, Z)) → ACTIVATE(X)
ACTIVATE(n__fst(X1, X2)) → FST(X1, X2)
ACTIVATE(n__len(X)) → LEN(X)
ADD(s(X), Y) → ACTIVATE(X)
ACTIVATE(n__add(X1, X2)) → ADD(X1, X2)
ACTIVATE(n__from(X)) → FROM(X)
FST(s(X), cons(Y, Z)) → ACTIVATE(Z)
LEN(cons(X, Z)) → ACTIVATE(Z)

The TRS R consists of the following rules:

fst(0, Z) → nil
fst(s(X), cons(Y, Z)) → cons(Y, n__fst(activate(X), activate(Z)))
from(X) → cons(X, n__from(s(X)))
add(0, X) → X
add(s(X), Y) → s(n__add(activate(X), Y))
len(nil) → 0
len(cons(X, Z)) → s(n__len(activate(Z)))
fst(X1, X2) → n__fst(X1, X2)
from(X) → n__from(X)
add(X1, X2) → n__add(X1, X2)
len(X) → n__len(X)
activate(n__fst(X1, X2)) → fst(X1, X2)
activate(n__from(X)) → from(X)
activate(n__add(X1, X2)) → add(X1, X2)
activate(n__len(X)) → len(X)
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 1 less node.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ QDP

              ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

FST(s(X), cons(Y, Z)) → ACTIVATE(X)
ACTIVATE(n__fst(X1, X2)) → FST(X1, X2)
ACTIVATE(n__len(X)) → LEN(X)
ADD(s(X), Y) → ACTIVATE(X)
ACTIVATE(n__add(X1, X2)) → ADD(X1, X2)
FST(s(X), cons(Y, Z)) → ACTIVATE(Z)
LEN(cons(X, Z)) → ACTIVATE(Z)

The TRS R consists of the following rules:

fst(0, Z) → nil
fst(s(X), cons(Y, Z)) → cons(Y, n__fst(activate(X), activate(Z)))
from(X) → cons(X, n__from(s(X)))
add(0, X) → X
add(s(X), Y) → s(n__add(activate(X), Y))
len(nil) → 0
len(cons(X, Z)) → s(n__len(activate(Z)))
fst(X1, X2) → n__fst(X1, X2)
from(X) → n__from(X)
add(X1, X2) → n__add(X1, X2)
len(X) → n__len(X)
activate(n__fst(X1, X2)) → fst(X1, X2)
activate(n__from(X)) → from(X)
activate(n__add(X1, X2)) → add(X1, X2)
activate(n__len(X)) → len(X)
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

FST(s(X), cons(Y, Z)) → ACTIVATE(X)
ACTIVATE(n__fst(X1, X2)) → FST(X1, X2)
FST(s(X), cons(Y, Z)) → ACTIVATE(Z)
LEN(cons(X, Z)) → ACTIVATE(Z)

The remaining pairs can at least be oriented weakly.

ACTIVATE(n__len(X)) → LEN(X)
ADD(s(X), Y) → ACTIVATE(X)
ACTIVATE(n__add(X1, X2)) → ADD(X1, X2)

Used ordering: Combined order from the following AFS and order.
FST(x1, x2) = FST(x1, x2)
s(x1) = x1
cons(x1, x2) = x2
ACTIVATE(x1) = x1
n__fst(x1, x2) = n__fst(x1, x2)
n__len(x1) = n__len(x1)
LEN(x1) = LEN(x1)
ADD(x1, x2) = x1
n__add(x1, x2) = x1

Lexicographic path order with status [19].
Quasi-Precedence:

n_{_fst₂} > FST₂
[n_{_len₁}, LEN_1]

Status:

n_{_fst₂}: [1,2]
FST₂: [1,2]
n_{_len₁}: [1]
LEN₁: [1]

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ QDP

              ↳ QDPOrderProof

                ↳ QDP

                  ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

ACTIVATE(n__len(X)) → LEN(X)
ADD(s(X), Y) → ACTIVATE(X)
ACTIVATE(n__add(X1, X2)) → ADD(X1, X2)

The TRS R consists of the following rules:

fst(0, Z) → nil
fst(s(X), cons(Y, Z)) → cons(Y, n__fst(activate(X), activate(Z)))
from(X) → cons(X, n__from(s(X)))
add(0, X) → X
add(s(X), Y) → s(n__add(activate(X), Y))
len(nil) → 0
len(cons(X, Z)) → s(n__len(activate(Z)))
fst(X1, X2) → n__fst(X1, X2)
from(X) → n__from(X)
add(X1, X2) → n__add(X1, X2)
len(X) → n__len(X)
activate(n__fst(X1, X2)) → fst(X1, X2)
activate(n__from(X)) → from(X)
activate(n__add(X1, X2)) → add(X1, X2)
activate(n__len(X)) → len(X)
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 1 less node.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ QDP

              ↳ QDPOrderProof

                ↳ QDP

                  ↳ DependencyGraphProof

                    ↳ QDP

                      ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

ADD(s(X), Y) → ACTIVATE(X)
ACTIVATE(n__add(X1, X2)) → ADD(X1, X2)

The TRS R consists of the following rules:

fst(0, Z) → nil
fst(s(X), cons(Y, Z)) → cons(Y, n__fst(activate(X), activate(Z)))
from(X) → cons(X, n__from(s(X)))
add(0, X) → X
add(s(X), Y) → s(n__add(activate(X), Y))
len(nil) → 0
len(cons(X, Z)) → s(n__len(activate(Z)))
fst(X1, X2) → n__fst(X1, X2)
from(X) → n__from(X)
add(X1, X2) → n__add(X1, X2)
len(X) → n__len(X)
activate(n__fst(X1, X2)) → fst(X1, X2)
activate(n__from(X)) → from(X)
activate(n__add(X1, X2)) → add(X1, X2)
activate(n__len(X)) → len(X)
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ADD(s(X), Y) → ACTIVATE(X)

The remaining pairs can at least be oriented weakly.

ACTIVATE(n__add(X1, X2)) → ADD(X1, X2)

Used ordering: Combined order from the following AFS and order.
ADD(x1, x2) = ADD(x1)
s(x1) = s(x1)
ACTIVATE(x1) = ACTIVATE(x1)
n__add(x1, x2) = x1

Lexicographic path order with status [19].
Quasi-Precedence:

[ADD₁, ACTIVATE_1]

Status:

ACTIVATE₁: [1]
ADD₁: [1]
s₁: [1]

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ QDP

              ↳ QDPOrderProof

                ↳ QDP

                  ↳ DependencyGraphProof

                    ↳ QDP

                      ↳ QDPOrderProof

                        ↳ QDP

                          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

ACTIVATE(n__add(X1, X2)) → ADD(X1, X2)

The TRS R consists of the following rules:

fst(0, Z) → nil
fst(s(X), cons(Y, Z)) → cons(Y, n__fst(activate(X), activate(Z)))
from(X) → cons(X, n__from(s(X)))
add(0, X) → X
add(s(X), Y) → s(n__add(activate(X), Y))
len(nil) → 0
len(cons(X, Z)) → s(n__len(activate(Z)))
fst(X1, X2) → n__fst(X1, X2)
from(X) → n__from(X)
add(X1, X2) → n__add(X1, X2)
len(X) → n__len(X)
activate(n__fst(X1, X2)) → fst(X1, X2)
activate(n__from(X)) → from(X)
activate(n__add(X1, X2)) → add(X1, X2)
activate(n__len(X)) → len(X)
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 0 SCCs with 1 less node.